Bu er Sharing in Shared Memory ATM Systems With Space Priority Tra c

In this paper we study the problem of the optimal design of bu er management policies for a shared memory ATM switch or demultiplexer fed by tra c containing two different space priorities. We present the properties of the optimal policy within the class of pushout and expelling policies that minimizes total weighted cell loss. A numerical study of the optimal policies for small bu er sizes based on the value iteration technique is used to help design heuristics applicable to large bu er sizes. Simulation studies for large bu er systems is then presented.